Cyclic and BCH codes whose minimum distance equals their maximum BCH bound
نویسندگان
چکیده
منابع مشابه
Cyclic and BCH codes whose minimum distance equals their maximum BCH bound
In this paper we study the family of cyclic codes such that its minimum distance reaches the maximum of its BCH bounds. We also show a way to construct cyclic codes with that property by means of computations of some divisors of a polynomial of the form xn − 1. We apply our results to the study of those BCH codes C, with designed distance δ, that have minimum distance d(C) = δ. Finally, we pres...
متن کاملDecoding Cyclic Codes Over Zq Beyond The BCH Bound
We present an efficient algorithm for computing a monic characteristic polynomial of a set of M finite R-sequences where R = GR(q, a), the a-dimensional Galois extension ring of Zq and apply it to the decoding of cyclic codes over Zq up to the Hartmann-Tzeng bound where multiple syndromes are available. Characterization of the set of characteristic polynomials of the M syndromes (interpreted as...
متن کاملThe Minimum Distance of Some Narrow-Sense Primitive BCH Codes
Due to wide applications of BCH codes, the determination of their minimum distance is of great interest. However, this is a very challenging problem for which few theoretical results have been reported in the last four decades. Even for the narrow-sense primitive BCH codes, which form the most well-studied subclass of BCH codes, there are very few theoretical results on the minimum distance. In...
متن کاملA new procedure for decoding cyclic and BCH codes up to actual minimum distance
In this paper, a new procedure for decoding cyclic and BCH codes up to their actual minimum distance is presented. Previous algebraic decoding procedures for cyclic and BCH codes such as the Peterson decoding procedure and our procedure using nonrecurrent syndrome dependence relations can be regarded as special cases of this new decoding procedure. With the aid of a computer prokram, it has bee...
متن کاملDecoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations
The decoding capabilities of algebraic algorithms, mainly the Berlekamp-Massey algorithm, the Euclidean algorithm and our generalizations of these algorithms, are basically constrained by the minimum distance bounds of the codes. Thus, when the actual minimum distance of the codes is greater than that given by the bounds, these algorithms usually cannot fully utilize the error-correcting capabi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics of Communications
سال: 2016
ISSN: 1930-5346
DOI: 10.3934/amc.2016018